Hybrid optimization for a binary inverse problem
نویسندگان
چکیده
We have developed a hybrid optimization algorithm for inversion of gravity data using a binary formulation. The new algorithm utilizes the Genetic Algorithm (GA) as a global search tool, while implementing Quenched Simulated Annealing (QSA) intermittently for local search. The hybrid has significantly decreased computational cost over GA or Simulated Annealing (SA) alone and has allowed for successful inversion of more realistic gravity problems. We illustrate the algorithm using a large 21⁄2D model derived from the SEG/EAGE 3D salt model, which has a complex background density profile and a pronounced nil zone.
منابع مشابه
A Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملA Classification Method for E-mail Spam Using a Hybrid Approach for Feature Selection Optimization
Spam is an unwanted email that is harmful to communications around the world. Spam leads to a growing problem in a personal email, so it would be essential to detect it. Machine learning is very useful to solve this problem as it shows good results in order to learn all the requisite patterns for classification due to its adaptive existence. Nonetheless, in spam detection, there are a large num...
متن کاملGA-based control of binary-continuous joints of a multi-link micromanipulator using SMA actuators
The paper presents a control strategy for a hyper redundant micromanipulator that has the particularity to have either a) binary joints: only a small finite number of position are allowed within min and max bounds and b) continuous joints: the joint can move continuously within its min and max bounds. The problem optimization is double: a)solve inverse kinematics for this kind of system and b) ...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کامل